Nash Inequalities for Finite Markov Chains
نویسنده
چکیده
This paper develops bounds on the rate of decay of powers of Markov kernels on finite state spaces. These are combined with eigenvalue estimates to give good bounds on the rate of convergence to stationarity for finite Markov chains whose underlying graph has moderate volume growth. Roughly, for such chains, order (diameter) 2 steps are necessary and suffice to reach stationarity. We consider local Poincar6 inequalities and use them to prove Nash inequalities. These are bounds on (,_-norms in terms of Dirichlet forms and l~-norms which yield decay rates for iterates of the kernel. This method is adapted from arguments developed by a number of authors in the context of partial differential equations and, later, in the study of random walks on infinite graphs. The main results do not require reversibility.
منابع مشابه
Merging for inhomogeneous finite Markov chains, part II: Nash and log-Sobolev inequalities
We study time-inhomogeneous Markov chains with finite state spaces using Nash and Logarithmic-Sobolev inequalities, and the notion of cstability. We develop the basic theory of such functional inequalities in the time-inhomogeneous context and provide illustrating examples.
متن کاملNash Equilibria in Partial - Information Games on Markov Chains † Technical Report
In this paper we consider two-player partial-information games on Markov chains. These are games in which two players are able to influence the state transitions in a Markov chain by taking appropriate actions. Each player attempts to minimize its own cost that is additive over time with the incremental costs depending on the state of the Markov chain and the actions taken by the players. We co...
متن کاملNash Equilibria in Partial-Information Games on Markov Chains∗
We consider a two-player partial-information game on a Markov chain, where each player attempts to minimize its own cost over a finite time horizon. We show that this game has always a Nash equilibrium in stochastic behavioral policies. The technique used to prove this result is constructive but has severe limitations because it involves solving an extremely large bi-matrix game. To alleviate t...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملEvolving sets, mixing and heat kernel bounds
We show that a new probabilistic technique, recently introduced by the first author, yields the sharpest bounds obtained to date on mixing times of Markov chains in terms of isoperimetric properties of the state space (also known as conductance bounds or Cheeger inequalities). We prove that the bounds for mixing time in total variation obtained by Lovász and Kannan, can be refined to apply to t...
متن کامل